DynaSoRe: Efficient In-Memory Store for Social Applications

نویسندگان

  • Xiao Bai
  • Arnaud Jégou
  • Flavio Paiva Junqueira
  • Vincent Leroy
چکیده

Social network applications are inherently interactive, creating a requirement for processing user requests fast. To enable fast responses to user requests, social network applications typically rely on large banks of cache servers to hold and serve most of their content from the cache. In this work, we present DynaSoRe: a memory cache system for social network applications that optimizes data locality while placing user views across the system. DynaSoRe storage servers monitor access traffic and bring data frequently accessed together closer in the system to reduce the processing load across cache servers and network devices. Our simulation results considering realistic data center topologies show that DynaSoRe is able to adapt to traffic changes, increase data locality, and balance the load across the system. The traffic handled by the top tier of the network connecting servers drops by 94% compared to a static assignment of views to cache servers while requiring only 30% additional memory capacity compared to the whole volume of cached data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Level Checkpoint Algorithm in a Highly-Available Parallel Single Level Store System

A Parallel Single Level Store systems (PSLS) integrates a shared virtual memory and a parallel file system. Managing globally the data, they provide programmers of scientific applications with the attractive shared memory programming model combined with a large and efficient file system in a cluster. In this paper, we present a cheap and efficient two-level checkpointing approach enabling a PSL...

متن کامل

The VIRTUOSE Distributed Object Store

Object-Oriented Database Management Systems break up into two components. The object manager deals with the management of logical objects and relies on the object store which implements system and transaction related features and manages physical objects. The efficiency of the object store strongly depends on the way memory and distribution management aspects are considered. Such aspects includ...

متن کامل

Smooth and Efficient Integration of High-Availability in a Parallel Single Level Store System

A parallel single level store (PSLS) system integrates a shared virtual memory and a parallel file system thus providing programmers with a global address space including both memory and file data. Parallel single level store systems implemented in a cluster thus represent an attractive support for long running parallel applications combining both the natural shared memory programming model and...

متن کامل

Modeling storage and retrieval of memories in the brain

We have proposed a neural network model that stores the incoming information after orthogonalizing it in the same manner as vectors are orthogonalized. The scheme enables the brain to compare a new informational system with those in the memory and store its similarities and differences with the old memories in an economical manner. This allows the brain to have an enormous capacity and yet the ...

متن کامل

Shortest Paths in Microseconds

Computing shortest paths is a fundamental primitive for several social network applications including sociallysensitive ranking, location-aware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency while maintaining feasible memory requirements. We present ASAP, a system that achieves this goal by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013